Changing the Diameter in Kronecker Product of Cycles
نویسندگان
چکیده
Communication speed in a network is related to its diameter. The diameter variability arises from the changes of links from networks. In this paper we study how the diameter of Kronecker product of cycles changes by adding edges.
منابع مشابه
تخمین جهت منابع با استفاده از زیرفضای کرونکر
This paper proceeds directions of arrival (DOA) estimation by a linear array. These years, some algorithms, e.g. Khatri-Rao approach, Nested array, Dynamic array have been proposed for estimating more DOAs than sensors. These algorithms can merely estimate uncorrelated sources. For Khatri-Rao approach, this is due to the fact that Khatri-Rao product discard the non-diagonal entries of the corre...
متن کاملOn the diameter of the Kronecker product graph
Let and be two undirected nontrivial graphs. The Kronecker product of and denoted by with vertex set , two vertices and are adjacent if and only if and . This paper presents a formula for computing the diameter of by means of the diameters and primitive exponents of factor graphs.
متن کاملOn Edge Exchanges in Hamiltonian Decompositions of Kronecker-product Graphs
Let G be a connected graph on n vertices, and let ; ; and be edge-disjoint cycles in G such that (i) ; (resp. ;) are vertex-disjoint and (ii) jj + jj = jj+ jj = n, where jj denotes the length of. We say that ; ; and yield two edge-disjoint hamiltonian cycles by edge exchanges if the four cycles respectively contain edges e; f; g and h such that each of (? feg) S (? ffg) S fg; hg and (? fgg) S (...
متن کاملVertex Censored Stochastic Kronecker Product Graphs
Stochastic Kronecker Product Graphs are an interesting and useful class of Generative Network Models. They can be fitted using a fast Maximum Likelihood Estimator and reproduce many important statistical properties commonly found in large real-world networks. However, they suffer from an unfortunate drawback: the need to pad the Stochastic Kronecker Product Graph with isolated vertices. To addr...
متن کاملHamiltonicity of large generalized de Bruijn cycles
In this article, we determine when the large generalized de Bruijn cycles BGC(p, d, n) are Hamiltonian. These digraphs have been introduced by Gómez, Padró and Pérennes as large interconnection networks with small diameter and they are a family of generalized p-cycles. They are the Kronecker product of the generalized de Bruijn digraph GB(d, n) and the dicycle of length p, where GB(d, n) is the...
متن کامل